Class Infomap
java.lang.Object
edu.claflin.finder.algo.Algorithm
edu.claflin.finder.algo.clustering.ClusteringAlgorithm
edu.claflin.finder.algo.clustering.Infomap
- All Implemented Interfaces:
Processable<Graph,Graph>
InfomapImplementation algorithm implemented using Mapping Higher-Order Network Flows in Memory
and Multilayer Networks with InfomapImplementation by Daniel Edler, Ludvig Bohlin and Martin Rosvall.
There are somewhat detailed comments and descriptions in:
edu.claflin.finder.algo.clustering.struct.louvain_struct.LouvainAlgorithm.java
-
Nested Class Summary
Nested classes/interfaces inherited from class edu.claflin.finder.algo.Algorithm
Algorithm.GraphSortOrder -
Field Summary
Fields inherited from class edu.claflin.finder.algo.Algorithm
args, PROP_PROGRESS -
Constructor Summary
Constructors -
Method Summary
Methods inherited from class edu.claflin.finder.algo.clustering.ClusteringAlgorithm
buildCommunityGraphs, isWeightedMethods inherited from class edu.claflin.finder.algo.Algorithm
addPropertyChangeListener, cull, getGraphSortOrder, getMinNodeCount, getPartiteNumber, getWeightName, removePropertyChangeListener, setGraphSortOrder, setMinNodeCount, setPartiteNumber, setProgress, setWeightName, zeropad
-
Constructor Details
-
Infomap
-
-
Method Details
-
toString
-
process
Performs community detection using the InfoMap algorithm- Parameters:
graph- the Graph on which community detection will be performed- Returns:
- the list of Graphs representing the clustering with the lowest average bit length measured by the MapEquation
-